Data-Driven Analysis of Variables and Dependencies in Continuous Optimization Problems and Estimation of Distribution Algorithms
نویسنده
چکیده
Optimization problems occur widely in various domains and are of great practical importance. Better solutions to optimization problems translate into increased production or efficiency, or less waste or error. As a result, the development of optimization algorithms is a large and active area of research. Although there is a large amount of theory and techniques for solving optimization problems, there are also many open issues and questions in understanding the relationship between optimization algorithms and the problems that they are applied to. In any optimization problem, the influence of each solution variable on the objective function, as well as the interactions between variables are very important. For example, if the variables in a problem are independent, then it might be efficiently solved by decomposition. If important dependencies exist between variables, an algorithm that is able to capture these dependencies may be able to exploit them to find good solutions. Alternatively, if a variable has a strong influence on the objective function, then an algorithm may be better off focusing its search on this variable, compared with another variable that has very little influence on the objective function. Estimation of Distribution Algorithms (EDAs) are a class of black-box optimization algorithms that learn and sample from a probabilistic model over the solution variables to carry out the search process. The explicit model in an EDA clearly specifies how the algorithm handles problem variables during the search process. A major focus in EDA research has been the incorporation of dependency modeling using models of varying complexity (e.g. probabilistic graphical models). The intuition behind this work is that if the algorithm model is capable and successful at capturing the structure of the problem, it will produce good performance on that problem. Experimental results have confirmed this intuition, for example EDAs that model dependency information have outperformed EDAs that do not model dependencies on certain problems. While EDAs have shown good performance results, little work has analyzed the dynamics of EDA models in practice. In fact, it is not clear what kind of problem structure EDAs can successfully model, or to what extent it is necessary to successfully model problem structure in order to achieve good performance. To provide insight into these issues, a more detailed analysis of EDAs applied to specific problems is needed. In this thesis, an experimental methodology is proposed to analyze the features of variables in continuous optimization problems and continuous EDAs. The approach is based on sampling points from the problem fitness landscape and/or the history of points visited by an EDA during the search process. These samples are then analyzed in three different ways, to identify key structural variables, variable dependencies and important variables. The techniques are used to analyze a variety of test problems and EDAs optimizing the same problem set. The results confirm that the interaction between
منابع مشابه
Incorporating Regular Vines in Estimation of Distribution Algorithms
This chapter presents the incorporation and use of regular vines into Estimation of Distribution Algorithms for solving numerical optimization problems. Several kinds of statistical dependencies among continuous variables can be taken into account by using regular vines. This work presents a procedure for selecting the most important dependencies in EDAs by truncating regular vines. Moreover, t...
متن کاملGradient-based Ant Colony Optimization for Continuous Spaces
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...
متن کاملGradient-based Ant Colony Optimization for Continuous Spaces
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...
متن کاملPERFORMANCE OF DIFFERENT ANT-BASED ALGORITHMS FOR OPTIMIZATION OF MIXED VARIABLE DOMAIN IN CIVIL ENGINEERING DESIGNS
Ant colony optimization algorithms (ACOs) have been basically introduced to discrete variable problems and applied to different research domains in several engineering fields. Meanwhile, abundant studies have been already involved to adapt different ant models to continuous search spaces. Assessments indicate competitive performance of ACOs on discrete or continuous domains. Therefore, as poten...
متن کاملFORCED WATER MAIN DESIGN MIXED ANT COLONY OPTIMIZATION
Most real world engineering design problems, such as cross-country water mains, include combinations of continuous, discrete, and binary value decision variables. Very often, the binary decision variables associate with the presence and/or absence of some nominated alternatives or project’s components. This study extends an existing continuous Ant Colony Optimization (ACO) algorithm to simultan...
متن کامل